Power and Time Efficient IP Lookup Table Design Using Partitioned TCAMs
نویسندگان
چکیده
منابع مشابه
Power and Time Efficient IP Lookup Table Design Using Partitioned TCAMs
This paper proposes a power and time efficient scheme for designing IP lookup tables. The proposed scheme uses partitioned Ternary Content Addressable Memories (TCAMs) that store IP lookup tables. The proposed scheme enables O(1) time penalty for updating an IP lookup table. The partitioned TCAMs allow an update done by a simple insertion without the need for routing table sorting. The organiza...
متن کاملAn IP packet forwarding technique based on partitioned lookup table
In this paper, we present an efficient IP packet forwarding methodology and architecture. This is achieved by partitioning the lookup table into the smaller ones for each output port and allowing a forwarding engine to process them in parallel. This effectively reduces the complexity of finding “the longest prefix match” problem to “the first prefix match” problem.
متن کاملIP Lookup Table Design using LC-trie with Memory Constraint
IP address lookup is to determine the next hop destination o f an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propos...
متن کاملAn Efficient IP Lookup Architecture with Fast Update Using Single-Match TCAMs
The increasing demand for new multimedia services requires the higher performance routers. The performance of Internet router highly depends on the efficiency of update operations as well as lookup operations on IP forwarding table. While IP lookup schemes based on TCAM(Ternary Content Addressable Memory) can achieve high speed lookup, they usually need more complex update operations because of...
متن کاملTowards More Power Efficient Ip Lookup Engines
Towards More Power Efficient IP Lookup Engines. (December 2005) Seraj Ahmad, Bachelor of Technology, Indian Institute of Technology, Guwahati, India Chair of Advisory Committee: Dr. Rabi N. Mahapatra The IP lookup in internet routers requires implementation of the longest prefix match algorithm. The software or hardware implementations of routing trie based approaches require several memory acc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Circuits and Systems
سال: 2013
ISSN: 2153-1285,2153-1293
DOI: 10.4236/cs.2013.43041